Arrays in Imperative Lambda
نویسنده
چکیده
In recent work, Swarup, Reddy, and Ireland deened a formal system called Imperative Lambda Calculus to provide clean integration of functional and imperative programming styles. In this paper, we study the issues of array manipulation in this framework. It is shown that the unique features of the calculus allow one to express array algorithms using high-level abstractions that are not available in purely functional languages.
منابع مشابه
Arrays in Imperative Lambda Calculus
In recent work, we defined a formal system called Imperative Lambda Calculus to provide clean integration of functional and imperative programming styles. In this paper, we study the issues of array manipulation in this framework. It is shown that the unique features of the calculus allow one to express array algorithms using high-level abstractions that are not available in purely functional l...
متن کاملLambda-lifting and CPS conversion in an imperative language
This paper is a companion technical report to the article “Continuation-Passing C: from threads to events through continuations”. It contains the complete version of the proofs of correctness of lambda-lifting and CPS-conversion presented in the article.
متن کاملA Type System for Functional Imperative Programming (Technical Summary)
In this paper, we explore the design of a powerful type system that provides a general mechanism to encapsulate low-level imperative program fragments into type-safe functional abstractions without imposing any single-threadedness constraint. Although connuence is the responsibility of the user, the type system guarantees that data-structures exported out of the functional abstraction are fully...
متن کاملA Type System for Functional Imperative
In this paper, we explore the design of a powerful type system that provides a general mechanism to encapsulate low-level imperative program fragments into type-safe functional abstractions without imposing any single-threadedness constraint. Although connuence is the responsibility of the user, the type system guarantees that data-structures exported out of the functional abstraction are fully...
متن کاملThe lambda mechanism in lambda calculus and in other calculi
A comparison of Landin’s form of lambda calculus with Church’s shows that, independently of the lambda calculus, there exists a mechanism for converting functions with arguments indexed by variables to the usual kind of function where the arguments are indexed numerically. We call this the “lambda mechanism” and show how it can be used in other calculi. In first-order predicate logic it can be ...
متن کامل